Smoothing with Cubic Splines
ثبت نشده
چکیده
A spline function is a curve constructed from polynomial segments that are subject to conditions or continuity at their joints. In this paper, we shall present the algorithm of the cubic smoothing spline and we shall justify its use in estimating trends in time series. Considerable effort has been devoted over several decades to developing the mathematics of spline functions. Much of the interest is due to the importance of splines in industrial design. In statistics, smoothing splines have been used in fitting curves to data ever since workable algorithms first became available in the late sixties—see Schoenberg [9] and Reinsch [8]. However, many statisticians have felt concern at the apparently arbitrary nature in this device. The difficulty is in finding an objective criterion for choosing the value of the parameter which governs the trade-off between smoothness of the curve and its closeness to the data points. At one extreme, where the smoothness is all that matters, the spline degenerates to the straight line of an ordinary linear least-squares regression. At the other extreme, it becomes the interpolating spline which passes through each of the data points. It appears to be a matter of judgment where in the spectrum between these two extremes the most appropriate curve should lie. One attempt at overcoming this arbitrariness has led to the criterion of cross-validation which was first proposed by Craven and Wahba [6]. Here the underlying notion is that the degree of smoothness should be chosen so as to make the spline the best possible predictor of any points in the data set to which it has not been fitted. Instead of reserving a collection of data points for the sole purpose of making this choice, it has been proposed that each of the available points should be left out in turn while the spline is fitted to the remainder. For each omitted point, there is then a corresponding error of prediction; and the optimal degree of smoothing is that which results in the minimum sum of squares of the prediction errors. To find the optimal degree of smoothing by the criterion of cross-validation can require an enormous amount of computing. An alternative procedure, which has emerged more recently, is based on the notion that the spline with an appropriate smoothing parameter represents the optimal predictor of the
منابع مشابه
Shape-preserving, multiscale fitting of univariate data by cubic L1 smoothing splines
Bivariate cubic L1 smoothing splines are introduced. The coefficients of a cubic L1 smoothing spline are calculated by minimizing the weighted sum of the L1 norms of second derivatives of the spline and the 1 norm of the residuals of the data-fitting equations. Cubic L1 smoothing splines are compared with conventional cubic smoothing splines based on the L2 and 2 norms. Computational results fo...
متن کاملComputationally Efficient Models of Urban and Natural Terrain by Non-iterative Domain Decomposition for L1 Smoothing Splines
In this paper, we propose and validate a computationally efficient non-iterative domain decomposition procedure for calculating bivariate cubic L1 smoothing splines. This domain decomposition procedure involves calculating local L1 smoothing splines individually on overlapping “extended subdomains” that cover the global domain and then creating the global L1 smoothing spline by patching togethe...
متن کاملCalculation of the smoothing spline with weighted roughness measure
The (cubic) smoothing spline, of Schoenberg [S64] and Reinsch [R67], [R71], has become the most commonly used spline, particularly after the introduction of generalized cross validation by Craven and Wahba [CW79] for an automatic choice of the smoothing parameter. It is the purpose of this note to derive the computational details, in terms of B-splines, for the construction of the weighted smoo...
متن کاملConstruction of spline functions in spreadsheets to smooth experimental data
Experimental data are often in need of smoothing without a pre-determined trend line equation. This manuscript demonstrates how spreadsheet software can be programmed to smooth experimental data via cubic splines. Once the trend lines (splines) have been constructed, it is also simple to interpolate values and calculate derivatives and integrals. The formulas to carry out the calculation are li...
متن کاملFast Polynomial Spline Approximation for Large Scattered Data Sets via L 1 Minimization
[Her13] F.Hernoux, R.Béarée, L.Gajny, E.Nyiri, J.Bancalin, O.Gibaru, Leap Motion pour la capture de mouvement 3D par spline L1. Application à la robotique. GTMG 2013, Marseille, 27-28 mars 2013 [Gib1899] J. Willard Gibbs, lettre à l’éditeur, Nature 59 (April 27, 1899) 606. [Lav00] J.E. Lavery, Univariate Cubic Lp splines and shape-preserving multiscale interpolation by univariate cubic L1 splin...
متن کاملSmoothing Arc Splines Using Cubic Bézier Spiral Transitions
Arc splines are planar, tangent continuous, piecewise curves made of circular arcs and straight line segments. They are important in manufacturing industries because of their use in the cutting paths for numerically controlled cutting machinery, highway route and robot paths. This paper considers how to smooth three kinds of G biarc models: the C-, S-, and J-shaped, by replacing their parts by ...
متن کامل